A Convex Programming Method for Rocket Powered Landing With Angle of Attack Constraint
نویسندگان
چکیده
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملA Parametric Successive Underestimation Method for Convex Programming Problems with an Additional Convex Multiplicative Constraint
A bstract This paper addresses itself to an algorithm for a convex minimization problem with an additional convex multiplicative constraint. A convex multiplicative constraint is such that a product of two convex functions is less than or equal to some constant. It is shown that this non convex problem can be solved by solving a sequence of convex programming problems. The basic idea of this al...
متن کاملMinimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization
To increase the science return of future missions toMars and to enable sample return missions, the accuracy with which a lander can be delivered to the Martian surface must be improved by orders of magnitude. The prior work developed a convex-optimization-based minimum-fuel powered-descent guidance algorithm. In this paper, this convex-optimization-based approach is extended to handle the casew...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملAdaptive constraint reduction for convex quadratic programming
We propose an adaptive, constraint-reduced, primal-dual interior-point algorithm for convex quadratic programming with many more inequality constraints than variables. We reduce the computational effort by assembling, instead of the exact normal-equation matrix, an approximate matrix from a well chosen index set which includes indices of constraints that seem to be most critical. Starting with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2997235